Efficient Parallel-in-Time Solution of Time-Periodic Problems Using a MultiHarmonic Coarse Grid Correction

نویسندگان

چکیده

This paper presents a highly parallelizable parallel-in-time algorithm for efficient solution of nonlinear time-periodic problems. It is based on the extension parareal method, known to accelerate sequential computations via parallelization fine grid. The proposed approach reduces complexity periodic by introducing simplified Newton algorithm, which allows an additional coarse In particular, at each iteration multiharmonic correction performed, converts block-cyclic system in time domain into block-diagonal frequency domain, thereby solving component parallel. convergence analysis method discussed one-dimensional model problem. introduced and several existing approaches are compared their application eddy current problem both linear models coaxial cable. Performance considered methods also illustrated three-dimensional transformer model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Newton-picard Approach for Efficient Numerical Solution of Time-periodic Parabolic Pde Constrained Optimization Problems

We investigate an iterative method for the solution of time-periodic parabolic PDE constrained optimization problems. It is an inexact Sequential Quadratic Programming (iSQP) method based on the Newton-Picard approach. We present and analyze a linear quadratic model problem and prove optimal mesh-independent convergence rates. Additionally, we propose a two-grid variant of the Newton-Picard met...

متن کامل

Parallel coarse-grid selection

Algebraic multigrid (AMG) is a powerful linear solver with attractive parallel properties. A parallel AMG method depends on efficient, parallel implementations of the coarse-grid selection algorithms and the restriction and prolongation operator construction algorithms. In the effort to effectively and quickly select the coarse grid, a number of parallel coarsening algorithms have been develope...

متن کامل

a time-series analysis of the demand for life insurance in iran

با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند

Solution of discrete-time optimal control problems on parallel computers

We describe locally-convergent algorithms for discrete-time optimal control problems which are amenable to multiprocessor implementation. Parallelism is achieved both through concurrent evaluation of the component functions and their derivatives, and through the use of a parallel band solver which solves a linear system to find the step at each iteration. Results from an implementation on the A...

متن کامل

Fast Parallel Direct Solvers for Coarse Grid Problems

We develop a fast direct solver for parallel solution of “coarse grid” problems, Ax = b, such as arise when domain decomposition or multigrid methods are applied to elliptic partial differential equations in d space dimensions. The approach is based upon a (quasi-) sparse factorization of the inverse of A. If A is n×n and the number of processors is P , the algorithm requires O(n log P ) time f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2021

ISSN: ['1095-7197', '1064-8275']

DOI: https://doi.org/10.1137/20m1314756